A memetic algorithm for the generalized traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a new memetic algorithm for GTSP which clearly outperforms the state-of-the-art memetic algorit...
متن کاملA New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
This paper introduces a new memetic algorithm specialized for the asymmetric instances of the traveling salesman problem (ATSP). The method incorporates a new local search engine and many other features that contribute to its effectiveness, such as: (i) the topological organization of the population as a complete ternary tree with thirteen nodes; (ii) the hierarchical organization of the popula...
متن کاملA memetic algorithm for symmetric traveling salesman problem
A Memetic Algorithm (MA) encompasses a class of approaches with proven practical success in variety of optimization problems aiming to make use of benefits of each individual approach. In this paper, we present a special designed Memetic Algorithm to solve the well-known Symmetric Traveling Salesman Problem (STSP).The main feature of the Memetic Algorithm is to use a local search combined with ...
متن کاملA Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem
The Generalized Traveling Salesman Problem (GTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), in which the set of cities is divided into mutually exclusive clusters. The objective of the GTSP consists in visiting each cluster exactly once in a tour, while minimizing the sum of the routing costs. This paper addresses the solution of the GTSP using a Memetic Algorithm....
متن کاملA Discrete State Transition Algorithm for Generalized Traveling Salesman Problem
Generalized traveling salesman problem (GTSP) is an extension of classical traveling salesman problem (TSP), which is a combinatorial optimization problem and an NP-hard problem. In this paper, an efficient discrete state transition algorithm (DSTA) for GTSP is proposed, where a new local search operator named K-circle, directed by neighborhood information in space, has been introduced to DSTA ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2009
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-009-9111-6